The introduction of a design heuristics extraction method

نویسندگان

  • Peter C. Matthews
  • Luciënne T. M. Blessing
  • Ken M. Wallace
چکیده

This paper introduces a novel method for analyzing conceptual design data. Given a database of previous designs, this method identifies relationships between design components within this database. Further, the method transforms these relationships into explicit design knowledge that can be used to generate a ‘heuristic-based’ model of the design domain for use at the conceptual stage. This can be viewed as a knowledge extracting method for the conceptual design stage. Such a method is particularly interesting, as the conceptual stage typically lacks explicit models to describe the trade-offs that must be made when designing. The method uses either Principal Components Analysis or Self Organizing Maps to identify the relationships, and this paper describes all the elements required by the method to successfully extract and verify design knowledge from design databases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem

Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...

متن کامل

KOLMOGOROV-SMIRNOV TEST TO TACKLE FAIR COMPARISON OF HEURISTIC APPROACHES IN STRUCTURAL OPTIMIZATION

This paper provides a test method to make a fair comparison between different heuristics in structure optimization. When statistical methods are applied to the structural optimization (namely heuristics or meta-heuristics with several tunable parameters and starting seeds), the "one problem - one result" is extremely far from the fair comparison. From statistical point of view, the minimal requ...

متن کامل

Optimal design of cross docking supply chain networks with time-varying uncertain demands

This paper proposes an integrated network design model for a post-distribution cross-docking strategy, comprising multi product production facilities with shared production resources, capacitated cross docks with setup cost and customer zones with time windows constraints. The model is dynamic in terms of time-varying uncertain demands, whereas uncertainty is expressed with scenario approach an...

متن کامل

SWITCHING TEAMS ALGORITHM FOR SIZING OPTIMIZATION OF TRUSS STRUCTURES

Meta-heuristics have received increasing attention in recent years. The present article introduces a novel method in such a class that distinguishes a number of artificial search agents called players within two teams. At each iteration, the active player concerns some other players in both teams to construct its special movements and to get more score. At the end of some iterations (like quart...

متن کامل

Implementation Procedures for the Risk in Early Design (RED) Method

Risk assessments performed at the conceptual design phase of a product may offer the greatest opportunity to increase product safety and reliability at the least cost. This is an especially difficult proposition, however, as often the product has not assumed a physical form at this early design stage. This paper introduces the Risk in Early Design (RED) method, a method for performing risk asse...

متن کامل

Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Advanced Engineering Informatics

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2002